(0) Obligation:
Runtime Complexity TRS:
The TRS R consists of the following rules:
active(f(g(X), Y)) → mark(f(X, f(g(X), Y)))
active(f(X1, X2)) → f(active(X1), X2)
active(g(X)) → g(active(X))
f(mark(X1), X2) → mark(f(X1, X2))
g(mark(X)) → mark(g(X))
proper(f(X1, X2)) → f(proper(X1), proper(X2))
proper(g(X)) → g(proper(X))
f(ok(X1), ok(X2)) → ok(f(X1, X2))
g(ok(X)) → ok(g(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
Rewrite Strategy: FULL
(1) RenamingProof (EQUIVALENT transformation)
Renamed function symbols to avoid clashes with predefined symbol.
(2) Obligation:
Runtime Complexity Relative TRS:
The TRS R consists of the following rules:
active(f(g(X), Y)) → mark(f(X, f(g(X), Y)))
active(f(X1, X2)) → f(active(X1), X2)
active(g(X)) → g(active(X))
f(mark(X1), X2) → mark(f(X1, X2))
g(mark(X)) → mark(g(X))
proper(f(X1, X2)) → f(proper(X1), proper(X2))
proper(g(X)) → g(proper(X))
f(ok(X1), ok(X2)) → ok(f(X1, X2))
g(ok(X)) → ok(g(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
S is empty.
Rewrite Strategy: FULL
(3) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)
Infered types.
(4) Obligation:
TRS:
Rules:
active(f(g(X), Y)) → mark(f(X, f(g(X), Y)))
active(f(X1, X2)) → f(active(X1), X2)
active(g(X)) → g(active(X))
f(mark(X1), X2) → mark(f(X1, X2))
g(mark(X)) → mark(g(X))
proper(f(X1, X2)) → f(proper(X1), proper(X2))
proper(g(X)) → g(proper(X))
f(ok(X1), ok(X2)) → ok(f(X1, X2))
g(ok(X)) → ok(g(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
Types:
active :: mark:ok → mark:ok
f :: mark:ok → mark:ok → mark:ok
g :: mark:ok → mark:ok
mark :: mark:ok → mark:ok
proper :: mark:ok → mark:ok
ok :: mark:ok → mark:ok
top :: mark:ok → top
hole_mark:ok1_0 :: mark:ok
hole_top2_0 :: top
gen_mark:ok3_0 :: Nat → mark:ok
(5) OrderProof (LOWER BOUND(ID) transformation)
Heuristically decided to analyse the following defined symbols:
active,
f,
g,
proper,
topThey will be analysed ascendingly in the following order:
f < active
g < active
active < top
f < proper
g < proper
proper < top
(6) Obligation:
TRS:
Rules:
active(
f(
g(
X),
Y)) →
mark(
f(
X,
f(
g(
X),
Y)))
active(
f(
X1,
X2)) →
f(
active(
X1),
X2)
active(
g(
X)) →
g(
active(
X))
f(
mark(
X1),
X2) →
mark(
f(
X1,
X2))
g(
mark(
X)) →
mark(
g(
X))
proper(
f(
X1,
X2)) →
f(
proper(
X1),
proper(
X2))
proper(
g(
X)) →
g(
proper(
X))
f(
ok(
X1),
ok(
X2)) →
ok(
f(
X1,
X2))
g(
ok(
X)) →
ok(
g(
X))
top(
mark(
X)) →
top(
proper(
X))
top(
ok(
X)) →
top(
active(
X))
Types:
active :: mark:ok → mark:ok
f :: mark:ok → mark:ok → mark:ok
g :: mark:ok → mark:ok
mark :: mark:ok → mark:ok
proper :: mark:ok → mark:ok
ok :: mark:ok → mark:ok
top :: mark:ok → top
hole_mark:ok1_0 :: mark:ok
hole_top2_0 :: top
gen_mark:ok3_0 :: Nat → mark:ok
Generator Equations:
gen_mark:ok3_0(0) ⇔ hole_mark:ok1_0
gen_mark:ok3_0(+(x, 1)) ⇔ mark(gen_mark:ok3_0(x))
The following defined symbols remain to be analysed:
f, active, g, proper, top
They will be analysed ascendingly in the following order:
f < active
g < active
active < top
f < proper
g < proper
proper < top
(7) RewriteLemmaProof (LOWER BOUND(ID) transformation)
Proved the following rewrite lemma:
f(
gen_mark:ok3_0(
+(
1,
n5_0)),
gen_mark:ok3_0(
b)) →
*4_0, rt ∈ Ω(n5
0)
Induction Base:
f(gen_mark:ok3_0(+(1, 0)), gen_mark:ok3_0(b))
Induction Step:
f(gen_mark:ok3_0(+(1, +(n5_0, 1))), gen_mark:ok3_0(b)) →RΩ(1)
mark(f(gen_mark:ok3_0(+(1, n5_0)), gen_mark:ok3_0(b))) →IH
mark(*4_0)
We have rt ∈ Ω(n1) and sz ∈ O(n). Thus, we have ircR ∈ Ω(n).
(8) Complex Obligation (BEST)
(9) Obligation:
TRS:
Rules:
active(
f(
g(
X),
Y)) →
mark(
f(
X,
f(
g(
X),
Y)))
active(
f(
X1,
X2)) →
f(
active(
X1),
X2)
active(
g(
X)) →
g(
active(
X))
f(
mark(
X1),
X2) →
mark(
f(
X1,
X2))
g(
mark(
X)) →
mark(
g(
X))
proper(
f(
X1,
X2)) →
f(
proper(
X1),
proper(
X2))
proper(
g(
X)) →
g(
proper(
X))
f(
ok(
X1),
ok(
X2)) →
ok(
f(
X1,
X2))
g(
ok(
X)) →
ok(
g(
X))
top(
mark(
X)) →
top(
proper(
X))
top(
ok(
X)) →
top(
active(
X))
Types:
active :: mark:ok → mark:ok
f :: mark:ok → mark:ok → mark:ok
g :: mark:ok → mark:ok
mark :: mark:ok → mark:ok
proper :: mark:ok → mark:ok
ok :: mark:ok → mark:ok
top :: mark:ok → top
hole_mark:ok1_0 :: mark:ok
hole_top2_0 :: top
gen_mark:ok3_0 :: Nat → mark:ok
Lemmas:
f(gen_mark:ok3_0(+(1, n5_0)), gen_mark:ok3_0(b)) → *4_0, rt ∈ Ω(n50)
Generator Equations:
gen_mark:ok3_0(0) ⇔ hole_mark:ok1_0
gen_mark:ok3_0(+(x, 1)) ⇔ mark(gen_mark:ok3_0(x))
The following defined symbols remain to be analysed:
g, active, proper, top
They will be analysed ascendingly in the following order:
g < active
active < top
g < proper
proper < top
(10) RewriteLemmaProof (LOWER BOUND(ID) transformation)
Proved the following rewrite lemma:
g(
gen_mark:ok3_0(
+(
1,
n674_0))) →
*4_0, rt ∈ Ω(n674
0)
Induction Base:
g(gen_mark:ok3_0(+(1, 0)))
Induction Step:
g(gen_mark:ok3_0(+(1, +(n674_0, 1)))) →RΩ(1)
mark(g(gen_mark:ok3_0(+(1, n674_0)))) →IH
mark(*4_0)
We have rt ∈ Ω(n1) and sz ∈ O(n). Thus, we have ircR ∈ Ω(n).
(11) Complex Obligation (BEST)
(12) Obligation:
TRS:
Rules:
active(
f(
g(
X),
Y)) →
mark(
f(
X,
f(
g(
X),
Y)))
active(
f(
X1,
X2)) →
f(
active(
X1),
X2)
active(
g(
X)) →
g(
active(
X))
f(
mark(
X1),
X2) →
mark(
f(
X1,
X2))
g(
mark(
X)) →
mark(
g(
X))
proper(
f(
X1,
X2)) →
f(
proper(
X1),
proper(
X2))
proper(
g(
X)) →
g(
proper(
X))
f(
ok(
X1),
ok(
X2)) →
ok(
f(
X1,
X2))
g(
ok(
X)) →
ok(
g(
X))
top(
mark(
X)) →
top(
proper(
X))
top(
ok(
X)) →
top(
active(
X))
Types:
active :: mark:ok → mark:ok
f :: mark:ok → mark:ok → mark:ok
g :: mark:ok → mark:ok
mark :: mark:ok → mark:ok
proper :: mark:ok → mark:ok
ok :: mark:ok → mark:ok
top :: mark:ok → top
hole_mark:ok1_0 :: mark:ok
hole_top2_0 :: top
gen_mark:ok3_0 :: Nat → mark:ok
Lemmas:
f(gen_mark:ok3_0(+(1, n5_0)), gen_mark:ok3_0(b)) → *4_0, rt ∈ Ω(n50)
g(gen_mark:ok3_0(+(1, n674_0))) → *4_0, rt ∈ Ω(n6740)
Generator Equations:
gen_mark:ok3_0(0) ⇔ hole_mark:ok1_0
gen_mark:ok3_0(+(x, 1)) ⇔ mark(gen_mark:ok3_0(x))
The following defined symbols remain to be analysed:
active, proper, top
They will be analysed ascendingly in the following order:
active < top
proper < top
(13) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol active.
(14) Obligation:
TRS:
Rules:
active(
f(
g(
X),
Y)) →
mark(
f(
X,
f(
g(
X),
Y)))
active(
f(
X1,
X2)) →
f(
active(
X1),
X2)
active(
g(
X)) →
g(
active(
X))
f(
mark(
X1),
X2) →
mark(
f(
X1,
X2))
g(
mark(
X)) →
mark(
g(
X))
proper(
f(
X1,
X2)) →
f(
proper(
X1),
proper(
X2))
proper(
g(
X)) →
g(
proper(
X))
f(
ok(
X1),
ok(
X2)) →
ok(
f(
X1,
X2))
g(
ok(
X)) →
ok(
g(
X))
top(
mark(
X)) →
top(
proper(
X))
top(
ok(
X)) →
top(
active(
X))
Types:
active :: mark:ok → mark:ok
f :: mark:ok → mark:ok → mark:ok
g :: mark:ok → mark:ok
mark :: mark:ok → mark:ok
proper :: mark:ok → mark:ok
ok :: mark:ok → mark:ok
top :: mark:ok → top
hole_mark:ok1_0 :: mark:ok
hole_top2_0 :: top
gen_mark:ok3_0 :: Nat → mark:ok
Lemmas:
f(gen_mark:ok3_0(+(1, n5_0)), gen_mark:ok3_0(b)) → *4_0, rt ∈ Ω(n50)
g(gen_mark:ok3_0(+(1, n674_0))) → *4_0, rt ∈ Ω(n6740)
Generator Equations:
gen_mark:ok3_0(0) ⇔ hole_mark:ok1_0
gen_mark:ok3_0(+(x, 1)) ⇔ mark(gen_mark:ok3_0(x))
The following defined symbols remain to be analysed:
proper, top
They will be analysed ascendingly in the following order:
proper < top
(15) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol proper.
(16) Obligation:
TRS:
Rules:
active(
f(
g(
X),
Y)) →
mark(
f(
X,
f(
g(
X),
Y)))
active(
f(
X1,
X2)) →
f(
active(
X1),
X2)
active(
g(
X)) →
g(
active(
X))
f(
mark(
X1),
X2) →
mark(
f(
X1,
X2))
g(
mark(
X)) →
mark(
g(
X))
proper(
f(
X1,
X2)) →
f(
proper(
X1),
proper(
X2))
proper(
g(
X)) →
g(
proper(
X))
f(
ok(
X1),
ok(
X2)) →
ok(
f(
X1,
X2))
g(
ok(
X)) →
ok(
g(
X))
top(
mark(
X)) →
top(
proper(
X))
top(
ok(
X)) →
top(
active(
X))
Types:
active :: mark:ok → mark:ok
f :: mark:ok → mark:ok → mark:ok
g :: mark:ok → mark:ok
mark :: mark:ok → mark:ok
proper :: mark:ok → mark:ok
ok :: mark:ok → mark:ok
top :: mark:ok → top
hole_mark:ok1_0 :: mark:ok
hole_top2_0 :: top
gen_mark:ok3_0 :: Nat → mark:ok
Lemmas:
f(gen_mark:ok3_0(+(1, n5_0)), gen_mark:ok3_0(b)) → *4_0, rt ∈ Ω(n50)
g(gen_mark:ok3_0(+(1, n674_0))) → *4_0, rt ∈ Ω(n6740)
Generator Equations:
gen_mark:ok3_0(0) ⇔ hole_mark:ok1_0
gen_mark:ok3_0(+(x, 1)) ⇔ mark(gen_mark:ok3_0(x))
The following defined symbols remain to be analysed:
top
(17) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol top.
(18) Obligation:
TRS:
Rules:
active(
f(
g(
X),
Y)) →
mark(
f(
X,
f(
g(
X),
Y)))
active(
f(
X1,
X2)) →
f(
active(
X1),
X2)
active(
g(
X)) →
g(
active(
X))
f(
mark(
X1),
X2) →
mark(
f(
X1,
X2))
g(
mark(
X)) →
mark(
g(
X))
proper(
f(
X1,
X2)) →
f(
proper(
X1),
proper(
X2))
proper(
g(
X)) →
g(
proper(
X))
f(
ok(
X1),
ok(
X2)) →
ok(
f(
X1,
X2))
g(
ok(
X)) →
ok(
g(
X))
top(
mark(
X)) →
top(
proper(
X))
top(
ok(
X)) →
top(
active(
X))
Types:
active :: mark:ok → mark:ok
f :: mark:ok → mark:ok → mark:ok
g :: mark:ok → mark:ok
mark :: mark:ok → mark:ok
proper :: mark:ok → mark:ok
ok :: mark:ok → mark:ok
top :: mark:ok → top
hole_mark:ok1_0 :: mark:ok
hole_top2_0 :: top
gen_mark:ok3_0 :: Nat → mark:ok
Lemmas:
f(gen_mark:ok3_0(+(1, n5_0)), gen_mark:ok3_0(b)) → *4_0, rt ∈ Ω(n50)
g(gen_mark:ok3_0(+(1, n674_0))) → *4_0, rt ∈ Ω(n6740)
Generator Equations:
gen_mark:ok3_0(0) ⇔ hole_mark:ok1_0
gen_mark:ok3_0(+(x, 1)) ⇔ mark(gen_mark:ok3_0(x))
No more defined symbols left to analyse.
(19) LowerBoundsProof (EQUIVALENT transformation)
The lowerbound Ω(n1) was proven with the following lemma:
f(gen_mark:ok3_0(+(1, n5_0)), gen_mark:ok3_0(b)) → *4_0, rt ∈ Ω(n50)
(20) BOUNDS(n^1, INF)
(21) Obligation:
TRS:
Rules:
active(
f(
g(
X),
Y)) →
mark(
f(
X,
f(
g(
X),
Y)))
active(
f(
X1,
X2)) →
f(
active(
X1),
X2)
active(
g(
X)) →
g(
active(
X))
f(
mark(
X1),
X2) →
mark(
f(
X1,
X2))
g(
mark(
X)) →
mark(
g(
X))
proper(
f(
X1,
X2)) →
f(
proper(
X1),
proper(
X2))
proper(
g(
X)) →
g(
proper(
X))
f(
ok(
X1),
ok(
X2)) →
ok(
f(
X1,
X2))
g(
ok(
X)) →
ok(
g(
X))
top(
mark(
X)) →
top(
proper(
X))
top(
ok(
X)) →
top(
active(
X))
Types:
active :: mark:ok → mark:ok
f :: mark:ok → mark:ok → mark:ok
g :: mark:ok → mark:ok
mark :: mark:ok → mark:ok
proper :: mark:ok → mark:ok
ok :: mark:ok → mark:ok
top :: mark:ok → top
hole_mark:ok1_0 :: mark:ok
hole_top2_0 :: top
gen_mark:ok3_0 :: Nat → mark:ok
Lemmas:
f(gen_mark:ok3_0(+(1, n5_0)), gen_mark:ok3_0(b)) → *4_0, rt ∈ Ω(n50)
g(gen_mark:ok3_0(+(1, n674_0))) → *4_0, rt ∈ Ω(n6740)
Generator Equations:
gen_mark:ok3_0(0) ⇔ hole_mark:ok1_0
gen_mark:ok3_0(+(x, 1)) ⇔ mark(gen_mark:ok3_0(x))
No more defined symbols left to analyse.
(22) LowerBoundsProof (EQUIVALENT transformation)
The lowerbound Ω(n1) was proven with the following lemma:
f(gen_mark:ok3_0(+(1, n5_0)), gen_mark:ok3_0(b)) → *4_0, rt ∈ Ω(n50)
(23) BOUNDS(n^1, INF)
(24) Obligation:
TRS:
Rules:
active(
f(
g(
X),
Y)) →
mark(
f(
X,
f(
g(
X),
Y)))
active(
f(
X1,
X2)) →
f(
active(
X1),
X2)
active(
g(
X)) →
g(
active(
X))
f(
mark(
X1),
X2) →
mark(
f(
X1,
X2))
g(
mark(
X)) →
mark(
g(
X))
proper(
f(
X1,
X2)) →
f(
proper(
X1),
proper(
X2))
proper(
g(
X)) →
g(
proper(
X))
f(
ok(
X1),
ok(
X2)) →
ok(
f(
X1,
X2))
g(
ok(
X)) →
ok(
g(
X))
top(
mark(
X)) →
top(
proper(
X))
top(
ok(
X)) →
top(
active(
X))
Types:
active :: mark:ok → mark:ok
f :: mark:ok → mark:ok → mark:ok
g :: mark:ok → mark:ok
mark :: mark:ok → mark:ok
proper :: mark:ok → mark:ok
ok :: mark:ok → mark:ok
top :: mark:ok → top
hole_mark:ok1_0 :: mark:ok
hole_top2_0 :: top
gen_mark:ok3_0 :: Nat → mark:ok
Lemmas:
f(gen_mark:ok3_0(+(1, n5_0)), gen_mark:ok3_0(b)) → *4_0, rt ∈ Ω(n50)
Generator Equations:
gen_mark:ok3_0(0) ⇔ hole_mark:ok1_0
gen_mark:ok3_0(+(x, 1)) ⇔ mark(gen_mark:ok3_0(x))
No more defined symbols left to analyse.
(25) LowerBoundsProof (EQUIVALENT transformation)
The lowerbound Ω(n1) was proven with the following lemma:
f(gen_mark:ok3_0(+(1, n5_0)), gen_mark:ok3_0(b)) → *4_0, rt ∈ Ω(n50)
(26) BOUNDS(n^1, INF)